\relax 
\citation{dorneles_approximate_2010}
\citation{hernandez_merge/purge_1995,elmagarmid_duplicate_2007}
\citation{dorneles_approximate_2010,branting_comparative_2003,hadjieleftheriou_approximate_2009}
\citation{xiao_top-k_2009}
\@writefile{toc}{\contentsline {title}{Uncertain instance matching over instance and schema heterogeneous data}{I}}
\@writefile{toc}{\authcount {1}}
\@writefile{toc}{\contentsline {author}{Samur Araujo\unskip {}, Duc Thanh Tran\unskip {}, Arjen de Vries\unskip {}, Marcel Reinders\unskip {}}{I}}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{I}}
\citation{papadakis_efficient_2011}
\citation{dorneles_approximate_2010}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Examples for ``Anemia'' in N3 notation (prefixes are used for brevity).}}{II}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Problem Definition}{III}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Preliminary Definitions}{III}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces A candidate set is associated to the each source instances (s1, s2, s3, s4).}}{IV}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Optimization Problem}{IV}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Heuristic Search Based Candidate Selection}{V}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces The cardinality of the candidate sets generated by this framework are systematically reduced.}}{VI}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Divide to Conquer}{VI}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Heuristic Search Modelling}{VI}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}States or Nodes}{VII}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces State 2 with two transition queries Q1 and Q2. In this example, the attribute query $q_A$ is the same in both queries.}}{VII}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Two distinct instances, distinguisible.}}{VIII}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Two distinct instances, indistinguishable.}}{VIII}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Cost Function}{VIII}}
\@writefile{toc}{\contentsline {subsubsection}{Heuristic Function}{VIII}}
\@writefile{toc}{\contentsline {subsubsection}{Transition Cost}{IX}}
\@writefile{toc}{\contentsline {subsubsection}{Path Cost}{IX}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Optimal Transition Space}{IX}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Optimal Transitions}{IX}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Transition Components}{X}}
\@writefile{toc}{\contentsline {subsubsection}{Class Query Component}{X}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Deriving Transition Queries}{X}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Deriving Attribute Query Components}{X}}
\@writefile{toc}{\contentsline {subsubsection}{Pair of attributes or alignment}{XI}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces Select a list of relative identifier pairs}}{XI}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Deriving Class Query Components}{XII}}
\@writefile{toc}{\contentsline {subsubsection}{From a solution set to class queries}{XII}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces Class Query Extractor Algorithm - Select class queries for a set of instances representations R}}{XII}}
\@writefile{toc}{\contentsline {subsubsection}{Class Query Generation Flow}{XIII}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces The process of generating transition queries from the candidate sets}}{XIII}}
\@writefile{toc}{\contentsline {subsubsection}{Precision issues}{XIV}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Igniting the engine}{XIV}}
\@writefile{toc}{\contentsline {subsubsection}{Starting state.}{XIV}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces A naive attribute query over discriminative instances produces smaller candidates sets.}}{XIV}}
\bibstyle{abbrv}
\bibdata{eswc}
\@writefile{toc}{\contentsline {section}{\numberline {6}Experiments}{XV}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces With CQ means that we use both attribute and class query component in the transition. Without CQ means that we use only attribute query component.}}{XV}}
\bibcite{arampatzis_modeling_2010}{1}
\bibcite{branting_comparative_2003}{2}
\bibcite{budanitsky_evaluating_2006}{3}
\bibcite{cohen_comparison_2003}{4}
\bibcite{dorneles_approximate_2010}{5}
\bibcite{elmagarmid_duplicate_2007}{6}
\bibcite{fellegi_theory_1969}{7}
\bibcite{hadjieleftheriou_approximate_2009}{8}
\bibcite{han_structural_2010}{9}
\bibcite{hernandez_merge/purge_1995}{10}
\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces Some results}}{XVI}}
\@writefile{toc}{\contentsline {section}{\numberline {7}Conclusions}{XVI}}
\bibcite{hu_bootstrapping_2011}{11}
\bibcite{juanzi_li_rimom:_2009}{12}
\bibcite{yongtao2011}{13}
\bibcite{mccallum_efficient_2000}{14}
\bibcite{melnik_similarity_2002}{15}
\bibcite{gomez-perez_overcoming_2009}{16}
\bibcite{Niu:2011:ZWC:2063076.2063091}{17}
\bibcite{papadakis_efficient_2011}{18}
\bibcite{das_sarma_bootstrapping_2008}{19}
\bibcite{spaccapietra_survey_2005}{20}
\bibcite{Song:2011:AGD:2063016.2063058}{21}
\bibcite{DBLP:conf/sigmod/TalukdarIP10}{22}
\bibcite{tversky_features_1977}{23}
\bibcite{bernstein_discovering_2009}{24}
\bibcite{xiao_top-k_2009}{25}
